A Note on Imprecise Monte Carlo over Credal Sets via Importance Sampling
نویسنده
چکیده
This brief paper is an exploratory investigation of how we can apply sensitivity analysis over importance sampling weights in order to obtain sampling estimates of lower previsions described by a parametric family of distributions. We demonstrate our results on the imprecise Dirichlet model, where we can compare with the analytically exact solution. We discuss the computational limitations of the approach, and propose a simple iterative importance sampling method in order to overcome these limitations. We find that the proposed method works pretty well, at least in the example studied, and we discuss some further possible extensions.
منابع مشابه
Importance Sampling over Sets: A New Probabilistic Inference Scheme
Computing expectations in high-dimensional spaces is a key challenge in probabilistic inference and machine learning. Monte Carlo sampling, and importance sampling in particular, is one of the leading approaches. We propose a generalized importance sampling scheme based on randomly selecting (exponentially large) subsets of states rather than individual ones. By collecting a small number of ext...
متن کاملFast Simulation of Linear Communication Systems via Conditional Monte Carlo Analysis
This paper presents a new technique for the fast simulation of the bit error rate and other statistical performance measures of communication systems. Whereas traditional fast simulation techniques are usually based on importance sampling, the proposed technique is based on conditional Monte Carlo analysis. One advantage over importance sampling is that the proposed technique is systematic in i...
متن کاملMonte Carlo inference via greedy importance sampling
We present a new method for conducting Monte Carlo inference in graphical models which combines explicit search with generalized importance sampling. The idea is to reduce the variance of importance sampling by searching for significant points in the target distribution. We prove that it is possible to introduce search and still maintain unbiasedness. We then demonstrate our procedure on a few ...
متن کاملAdaptive Importance Sampling via Stochastic Convex Programming
We show that the variance of the Monte Carlo estimator that is importance sampled from an exponential family is a convex function of the natural parameter of the distribution. With this insight, we propose an adaptive importance sampling algorithm that simultaneously improves the choice of sampling distribution while accumulating a Monte Carlo estimate. Exploiting convexity, we prove that the m...
متن کاملUpper entropy of credal sets. Applications to credal classification
We present an application of the measure of entropy for credal sets: as a branching criterion for constructing classification trees based on imprecise probabilities which are determined with the imprecise Dirichlet model. We also justify the use of upper entropy as a global uncertainty measure for credal sets and present a deduction of this measure. We have carried out several experiments in wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017